Skip to main content

Easy ✔

  1. Remove Outermost Parentheses
    1. 17 March, 2026: 00.25.19 ❌
      • Approach was right
      • Couldn't able to implement push, pop in appropriate order/way/position.
    2. 30 March, 2026: 00.07.13 ✔
  2. Reverse words in a given string
  3. Largest Odd Number in a String
    1. 05 March, 2026: 00.03.39 ✔
    2. 30 March, 2026: 00.02.14 ✔
  4. Longest Common Prefix
    1. 17 March, 2026: 00.27.18 ❌
      • Couldn't able to solve it
    2. 30 March, 2026: 00.21.06 ✔
      • Failed at edge case(if no item found, the smallest one is the answer)
  5. Isomorphic String
    1. 17 March, 2026: 00.35.24 ❌
      • Couldn't able to solve it
      • Keep repeating same mistake
      • You're only comparing character frequencies, but isomorphic strings depend on character mapping and positions, not just counts.
      • Map one character with another character from different string.
        Indexs[i]t[i]Mapping
        0ptp → t
        1aia → i
        2ptalready mapped ✔
        3ele → l
        4rer → e
    2. 30 March, 2026: 00.11.25 ❌
      • Hints: Use two hash map
  6. Rotate String
    1. 05 March, 2026: 00.23.12 ❌
      • Couldn't able to implement it
    2. 30 March, 2026: 00.17.43 ❌
      • string::npos is a special constant in C++ that represent not found
  7. Check if two strings are anagram of each other